Equitable factorizations of edge-connected graphs
نویسندگان
چکیده
In this paper, we show that every ( 3 k − ) -edge-connected graph G , under a certain degree condition, can be edge-decomposed into factors 1 … such for each vertex v ∈ V i | d / < where ≤ . As an application, deduce 6 three 2 and with unless has exactly one z ⁄ ≡ 0 Next, odd- have the same parity is odd positive integer Finally, give sufficient edge-connectivity condition to factor F specified odd-degree vertices ɛ real number
منابع مشابه
Equitable Edge Domination in Graphs
A subset D of V (G) is called an equitable dominating set of a graph G if for every v ∈ (V − D), there exists a vertex u ∈ D such that uv ∈ E(G) and |deg(u) − deg(v)| 6 1. The minimum cardinality of such a dominating set is denoted by γe(G) and is called equitable domination number of G. In this paper we introduce the equitable edge domination and equitable edge domatic number in a graph, exact...
متن کاملNeighborhood Connected Equitable Domination in Graphs
Let G = (V,E) be a connected graph, An equitable dominating S of a graph G is called the neighborhood connected equitable dominating set (nced-set) if the induced subgraph 〈Ne(S)〉 is connected The minimum cardinality of a nced-set of G is called the neighborhood connected equitable domination number of G and is denoted by γnce(G). In this paper we initiate a study of this parameter. For any gra...
متن کاملEquitable factorizations of Hamming shells
We construct a 1-factorization of the complement Σm of the linear Hamming code of length m = mr = 2 r − 1 in the m-cube Qm, for r ≥ 2, having the following equitable property: its component 1-factors intersect each Cayley parallel 1-factor of Qm at a constant number of edges, (namely 2r edges). In the way to that construction, we find an equitable mr−1-factorization of Σm formed by two factors ...
متن کاملGenerating connected and 2-edge connected graphs
We focus on the algorithm underlying the main result of [6]. This is an algebraic formula to generate all connected graphs in a recursive and efficient manner. The key feature is that each graph carries a scalar factor given by the inverse of the order of its group of automorphisms. In the present paper, we revise that algorithm on the level of graphs. Moreover, we extend the result subsequentl...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2022
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2022.03.018